/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 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 04:14:26,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 04:14:26,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 04:14:26,915 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 04:14:26,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 04:14:26,918 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 04:14:26,920 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 04:14:26,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 04:14:26,922 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 04:14:26,926 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 04:14:26,927 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 04:14:26,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 04:14:26,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 04:14:26,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 04:14:26,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 04:14:26,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 04:14:26,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 04:14:26,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 04:14:26,936 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 04:14:26,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 04:14:26,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 04:14:26,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 04:14:26,941 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 04:14:26,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 04:14:26,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 04:14:26,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 04:14:26,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 04:14:26,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 04:14:26,950 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 04:14:26,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 04:14:26,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 04:14:26,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 04:14:26,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 04:14:26,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 04:14:26,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 04:14:26,952 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 04:14:26,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 04:14:26,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 04:14:26,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 04:14:26,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 04:14:26,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 04:14:26,955 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-28 04:14:26,976 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 04:14:26,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 04:14:26,977 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 04:14:26,977 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 04:14:26,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 04:14:26,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 04:14:26,978 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 04:14:26,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 04:14:26,978 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 04:14:26,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 04:14:26,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 04:14:26,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 04:14:26,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 04:14:26,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 04:14:26,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 04:14:26,979 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 04:14:26,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 04:14:26,979 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 04:14:26,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 04:14:26,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 04:14:26,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 04:14:26,980 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 04:14:26,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 04:14:26,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 04:14:26,980 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 04:14:26,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 04:14:26,980 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 04:14:26,980 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 04:14:26,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 04:14:26,981 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 04:14:26,981 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 04:14:26,981 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 04:14:27,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 04:14:27,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 04:14:27,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 04:14:27,174 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 04:14:27,174 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 04:14:27,175 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2023-01-28 04:14:28,186 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 04:14:28,329 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 04:14:28,329 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2023-01-28 04:14:28,334 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4094ea97/febbc3a8db8d4ea39ae30a908c0d179b/FLAG2bfc56c41 [2023-01-28 04:14:28,343 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4094ea97/febbc3a8db8d4ea39ae30a908c0d179b [2023-01-28 04:14:28,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 04:14:28,346 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 04:14:28,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 04:14:28,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 04:14:28,349 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 04:14:28,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 04:14:28" (1/1) ... [2023-01-28 04:14:28,350 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26bb26b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:14:28, skipping insertion in model container [2023-01-28 04:14:28,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 04:14:28" (1/1) ... [2023-01-28 04:14:28,354 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 04:14:28,368 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 04:14:28,509 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/popl20-min-max-dec.wvr.c[3019,3032] [2023-01-28 04:14:28,516 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 04:14:28,523 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 04:14:28,542 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/popl20-min-max-dec.wvr.c[3019,3032] [2023-01-28 04:14:28,545 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 04:14:28,551 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 04:14:28,552 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 04:14:28,557 INFO L208 MainTranslator]: Completed translation [2023-01-28 04:14:28,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:14:28 WrapperNode [2023-01-28 04:14:28,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 04:14:28,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 04:14:28,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 04:14:28,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 04:14:28,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:14:28" (1/1) ... [2023-01-28 04:14:28,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:14:28" (1/1) ... [2023-01-28 04:14:28,593 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2023-01-28 04:14:28,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 04:14:28,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 04:14:28,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 04:14:28,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 04:14:28,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:14:28" (1/1) ... [2023-01-28 04:14:28,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:14:28" (1/1) ... [2023-01-28 04:14:28,603 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:14:28" (1/1) ... [2023-01-28 04:14:28,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:14:28" (1/1) ... [2023-01-28 04:14:28,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:14:28" (1/1) ... [2023-01-28 04:14:28,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:14:28" (1/1) ... [2023-01-28 04:14:28,612 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:14:28" (1/1) ... [2023-01-28 04:14:28,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:14:28" (1/1) ... [2023-01-28 04:14:28,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 04:14:28,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 04:14:28,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 04:14:28,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 04:14:28,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:14:28" (1/1) ... [2023-01-28 04:14:28,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 04:14:28,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:14:28,647 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-28 04:14:28,653 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-28 04:14:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 04:14:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 04:14:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 04:14:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 04:14:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 04:14:28,679 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 04:14:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 04:14:28,681 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 04:14:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-28 04:14:28,682 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-28 04:14:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-01-28 04:14:28,682 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-01-28 04:14:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 04:14:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 04:14:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 04:14:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-28 04:14:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 04:14:28,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 04:14:28,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 04:14:28,684 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 04:14:28,777 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 04:14:28,779 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 04:14:29,137 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 04:14:29,229 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 04:14:29,229 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-01-28 04:14:29,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 04:14:29 BoogieIcfgContainer [2023-01-28 04:14:29,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 04:14:29,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 04:14:29,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 04:14:29,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 04:14:29,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 04:14:28" (1/3) ... [2023-01-28 04:14:29,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304c681f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 04:14:29, skipping insertion in model container [2023-01-28 04:14:29,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:14:28" (2/3) ... [2023-01-28 04:14:29,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304c681f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 04:14:29, skipping insertion in model container [2023-01-28 04:14:29,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 04:14:29" (3/3) ... [2023-01-28 04:14:29,236 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2023-01-28 04:14:29,247 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 04:14:29,247 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 04:14:29,247 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 04:14:29,321 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-01-28 04:14:29,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 162 transitions, 356 flow [2023-01-28 04:14:29,388 INFO L130 PetriNetUnfolder]: 12/158 cut-off events. [2023-01-28 04:14:29,388 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-28 04:14:29,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 158 events. 12/158 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 115 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 126. Up to 2 conditions per place. [2023-01-28 04:14:29,394 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 162 transitions, 356 flow [2023-01-28 04:14:29,398 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 146 transitions, 316 flow [2023-01-28 04:14:29,405 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 04:14:29,416 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 146 transitions, 316 flow [2023-01-28 04:14:29,421 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 146 transitions, 316 flow [2023-01-28 04:14:29,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 146 transitions, 316 flow [2023-01-28 04:14:29,463 INFO L130 PetriNetUnfolder]: 12/146 cut-off events. [2023-01-28 04:14:29,464 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-28 04:14:29,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 146 events. 12/146 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 114 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 126. Up to 2 conditions per place. [2023-01-28 04:14:29,469 INFO L119 LiptonReduction]: Number of co-enabled transitions 2280 [2023-01-28 04:14:33,510 INFO L134 LiptonReduction]: Checked pairs total: 3482 [2023-01-28 04:14:33,511 INFO L136 LiptonReduction]: Total number of compositions: 134 [2023-01-28 04:14:33,533 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 04:14:33,537 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;@644f6fc7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 04:14:33,538 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 04:14:33,547 INFO L130 PetriNetUnfolder]: 4/30 cut-off events. [2023-01-28 04:14:33,557 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-28 04:14:33,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:14:33,557 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] [2023-01-28 04:14:33,558 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:14:33,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:14:33,561 INFO L85 PathProgramCache]: Analyzing trace with hash -957242749, now seen corresponding path program 1 times [2023-01-28 04:14:33,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:14:33,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132894785] [2023-01-28 04:14:33,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:14:33,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:14:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:14:33,880 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-28 04:14:33,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:14:33,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132894785] [2023-01-28 04:14:33,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132894785] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:14:33,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:14:33,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 04:14:33,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990967714] [2023-01-28 04:14:33,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:14:33,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 04:14:33,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:14:33,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 04:14:33,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 04:14:33,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 296 [2023-01-28 04:14:33,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 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-28 04:14:33,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:14:33,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 296 [2023-01-28 04:14:33,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:14:34,128 INFO L130 PetriNetUnfolder]: 1420/1898 cut-off events. [2023-01-28 04:14:34,128 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2023-01-28 04:14:34,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3999 conditions, 1898 events. 1420/1898 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7098 event pairs, 765 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 3498. Up to 1552 conditions per place. [2023-01-28 04:14:34,141 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 42 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2023-01-28 04:14:34,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 215 flow [2023-01-28 04:14:34,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 04:14:34,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 04:14:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-01-28 04:14:34,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46790540540540543 [2023-01-28 04:14:34,154 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-01-28 04:14:34,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-01-28 04:14:34,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:14:34,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-01-28 04:14:34,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 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-28 04:14:34,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 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-28 04:14:34,169 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 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-28 04:14:34,171 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 4 states and 554 transitions. [2023-01-28 04:14:34,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 215 flow [2023-01-28 04:14:34,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 193 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-01-28 04:14:34,178 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2023-01-28 04:14:34,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2023-01-28 04:14:34,182 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-01-28 04:14:34,182 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2023-01-28 04:14:34,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 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-28 04:14:34,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:14:34,183 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] [2023-01-28 04:14:34,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 04:14:34,183 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:14:34,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:14:34,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1622835390, now seen corresponding path program 1 times [2023-01-28 04:14:34,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:14:34,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693194839] [2023-01-28 04:14:34,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:14:34,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:14:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:14:34,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 04:14:34,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:14:34,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693194839] [2023-01-28 04:14:34,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693194839] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:14:34,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:14:34,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 04:14:34,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174632521] [2023-01-28 04:14:34,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:14:34,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 04:14:34,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:14:34,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 04:14:34,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 04:14:34,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 296 [2023-01-28 04:14:34,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-28 04:14:34,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:14:34,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 296 [2023-01-28 04:14:34,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:14:34,482 INFO L130 PetriNetUnfolder]: 1718/2336 cut-off events. [2023-01-28 04:14:34,483 INFO L131 PetriNetUnfolder]: For 549/549 co-relation queries the response was YES. [2023-01-28 04:14:34,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5313 conditions, 2336 events. 1718/2336 cut-off events. For 549/549 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8125 event pairs, 977 based on Foata normal form. 0/1943 useless extension candidates. Maximal degree in co-relation 2424. Up to 1790 conditions per place. [2023-01-28 04:14:34,493 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 47 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-01-28 04:14:34,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 233 flow [2023-01-28 04:14:34,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 04:14:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 04:14:34,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 557 transitions. [2023-01-28 04:14:34,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4704391891891892 [2023-01-28 04:14:34,495 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 557 transitions. [2023-01-28 04:14:34,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 557 transitions. [2023-01-28 04:14:34,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:14:34,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 557 transitions. [2023-01-28 04:14:34,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 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-28 04:14:34,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 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-28 04:14:34,499 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 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-28 04:14:34,499 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 4 states and 557 transitions. [2023-01-28 04:14:34,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 233 flow [2023-01-28 04:14:34,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 223 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 04:14:34,501 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2023-01-28 04:14:34,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2023-01-28 04:14:34,502 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-01-28 04:14:34,502 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2023-01-28 04:14:34,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-28 04:14:34,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:14:34,502 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] [2023-01-28 04:14:34,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 04:14:34,502 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:14:34,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:14:34,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1337805984, now seen corresponding path program 1 times [2023-01-28 04:14:34,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:14:34,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796734272] [2023-01-28 04:14:34,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:14:34,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:14:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:14:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 04:14:34,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:14:34,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796734272] [2023-01-28 04:14:34,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796734272] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:14:34,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:14:34,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 04:14:34,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600673585] [2023-01-28 04:14:34,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:14:34,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 04:14:34,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:14:34,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 04:14:34,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 04:14:34,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 296 [2023-01-28 04:14:34,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-28 04:14:34,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:14:34,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 296 [2023-01-28 04:14:34,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:14:34,800 INFO L130 PetriNetUnfolder]: 1632/2232 cut-off events. [2023-01-28 04:14:34,800 INFO L131 PetriNetUnfolder]: For 545/694 co-relation queries the response was YES. [2023-01-28 04:14:34,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5578 conditions, 2232 events. 1632/2232 cut-off events. For 545/694 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8389 event pairs, 977 based on Foata normal form. 149/1982 useless extension candidates. Maximal degree in co-relation 1672. Up to 1790 conditions per place. [2023-01-28 04:14:34,810 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 46 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-01-28 04:14:34,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 240 flow [2023-01-28 04:14:34,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 04:14:34,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 04:14:34,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-01-28 04:14:34,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46790540540540543 [2023-01-28 04:14:34,812 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-01-28 04:14:34,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-01-28 04:14:34,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:14:34,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-01-28 04:14:34,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 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-28 04:14:34,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 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-28 04:14:34,815 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 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-28 04:14:34,815 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 4 states and 554 transitions. [2023-01-28 04:14:34,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 240 flow [2023-01-28 04:14:34,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 231 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 04:14:34,818 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 100 flow [2023-01-28 04:14:34,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-01-28 04:14:34,819 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-01-28 04:14:34,821 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 100 flow [2023-01-28 04:14:34,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-28 04:14:34,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:14:34,822 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] [2023-01-28 04:14:34,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 04:14:34,822 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:14:34,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:14:34,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1347991008, now seen corresponding path program 1 times [2023-01-28 04:14:34,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:14:34,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790154194] [2023-01-28 04:14:34,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:14:34,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:14:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:14:34,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 04:14:34,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:14:34,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790154194] [2023-01-28 04:14:34,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790154194] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:14:34,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:14:34,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 04:14:34,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512615004] [2023-01-28 04:14:34,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:14:34,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 04:14:34,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:14:34,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 04:14:34,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 04:14:34,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 296 [2023-01-28 04:14:34,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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-28 04:14:34,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:14:34,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 296 [2023-01-28 04:14:34,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:14:35,145 INFO L130 PetriNetUnfolder]: 1632/2233 cut-off events. [2023-01-28 04:14:35,146 INFO L131 PetriNetUnfolder]: For 878/1027 co-relation queries the response was YES. [2023-01-28 04:14:35,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5793 conditions, 2233 events. 1632/2233 cut-off events. For 878/1027 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8188 event pairs, 1243 based on Foata normal form. 149/1978 useless extension candidates. Maximal degree in co-relation 1883. Up to 2223 conditions per place. [2023-01-28 04:14:35,155 INFO L137 encePairwiseOnDemand]: 293/296 looper letters, 32 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-01-28 04:14:35,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 170 flow [2023-01-28 04:14:35,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 04:14:35,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 04:14:35,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2023-01-28 04:14:35,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380630630630631 [2023-01-28 04:14:35,161 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2023-01-28 04:14:35,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2023-01-28 04:14:35,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:14:35,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2023-01-28 04:14:35,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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-28 04:14:35,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 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-28 04:14:35,164 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 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-28 04:14:35,164 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 100 flow. Second operand 3 states and 389 transitions. [2023-01-28 04:14:35,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 170 flow [2023-01-28 04:14:35,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 164 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 04:14:35,167 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 106 flow [2023-01-28 04:14:35,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-01-28 04:14:35,169 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-01-28 04:14:35,170 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 106 flow [2023-01-28 04:14:35,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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-28 04:14:35,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:14:35,170 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] [2023-01-28 04:14:35,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 04:14:35,170 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:14:35,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:14:35,170 INFO L85 PathProgramCache]: Analyzing trace with hash -406219004, now seen corresponding path program 1 times [2023-01-28 04:14:35,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:14:35,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099161622] [2023-01-28 04:14:35,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:14:35,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:14:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:14:35,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 04:14:35,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:14:35,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099161622] [2023-01-28 04:14:35,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099161622] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:14:35,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161135279] [2023-01-28 04:14:35,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:14:35,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:14:35,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:14:35,778 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-28 04:14:35,821 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-28 04:14:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:14:35,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-28 04:14:35,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:14:36,086 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-28 04:14:36,134 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-28 04:14:36,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 04:14:36,179 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-28 04:14:36,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 04:14:36,230 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-28 04:14:36,247 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-28 04:14:36,288 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 39 treesize of output 21 [2023-01-28 04:14:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:14:36,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:14:36,396 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 49 treesize of output 25 [2023-01-28 04:14:36,642 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ 2 .cse0)) (< 2147483646 .cse0)))) (<= (select (select .cse1 c_~A~0.base) c_~A~0.offset) c_~min~0)))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse2 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 .cse2) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset))) (or (< .cse2 (+ 2 .cse3)) (< 2147483646 .cse3))))))))) is different from false [2023-01-28 04:14:36,668 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse1 (select (select .cse3 c_~A~0.base) c_~A~0.offset))) (or (< .cse0 .cse1) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset))) (or (< .cse1 (+ 2 .cse2)) (< 2147483646 .cse2)))))))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (<= (select (select .cse4 c_~A~0.base) c_~A~0.offset) .cse0) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse5 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset))) (or (< .cse0 (+ 2 .cse5)) (< 2147483646 .cse5))))))))) is different from false [2023-01-28 04:14:36,718 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse0 (+ .cse1 2)) (< 2147483646 .cse1)))) (< (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse0)))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (<= (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse5) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse5 (+ .cse6 2)) (< 2147483646 .cse6))))))))) is different from false [2023-01-28 04:14:36,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 04:14:36,738 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 125 treesize of output 77 [2023-01-28 04:14:36,745 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 2845 treesize of output 2653 [2023-01-28 04:14:36,772 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 110 treesize of output 104 [2023-01-28 04:14:36,778 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 136 treesize of output 120 [2023-01-28 04:14:36,784 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 150 treesize of output 138 [2023-01-28 04:14:36,851 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 04:14:36,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 1 [2023-01-28 04:14:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-01-28 04:14:36,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161135279] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:14:36,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:14:36,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2023-01-28 04:14:36,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820348868] [2023-01-28 04:14:36,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:14:36,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-28 04:14:36,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:14:36,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-28 04:14:36,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=577, Unknown=9, NotChecked=156, Total=870 [2023-01-28 04:14:36,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 296 [2023-01-28 04:14:36,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 106 flow. Second operand has 30 states, 30 states have (on average 98.0) internal successors, (2940), 30 states have internal predecessors, (2940), 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-28 04:14:36,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:14:36,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 296 [2023-01-28 04:14:36,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:14:39,760 INFO L130 PetriNetUnfolder]: 12624/17356 cut-off events. [2023-01-28 04:14:39,760 INFO L131 PetriNetUnfolder]: For 4404/5446 co-relation queries the response was YES. [2023-01-28 04:14:39,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44463 conditions, 17356 events. 12624/17356 cut-off events. For 4404/5446 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 93205 event pairs, 1024 based on Foata normal form. 1052/14660 useless extension candidates. Maximal degree in co-relation 44449. Up to 4507 conditions per place. [2023-01-28 04:14:39,829 INFO L137 encePairwiseOnDemand]: 286/296 looper letters, 240 selfloop transitions, 47 changer transitions 267/555 dead transitions. [2023-01-28 04:14:39,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 555 transitions, 2750 flow [2023-01-28 04:14:39,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-01-28 04:14:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-01-28 04:14:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 3633 transitions. [2023-01-28 04:14:39,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37192874692874694 [2023-01-28 04:14:39,842 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 3633 transitions. [2023-01-28 04:14:39,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 3633 transitions. [2023-01-28 04:14:39,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:14:39,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 3633 transitions. [2023-01-28 04:14:39,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 110.0909090909091) internal successors, (3633), 33 states have internal predecessors, (3633), 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-28 04:14:39,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 296.0) internal successors, (10064), 34 states have internal predecessors, (10064), 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-28 04:14:39,860 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 296.0) internal successors, (10064), 34 states have internal predecessors, (10064), 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-28 04:14:39,861 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 106 flow. Second operand 33 states and 3633 transitions. [2023-01-28 04:14:39,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 555 transitions, 2750 flow [2023-01-28 04:14:39,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 555 transitions, 2746 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 04:14:39,916 INFO L231 Difference]: Finished difference. Result has 99 places, 86 transitions, 498 flow [2023-01-28 04:14:39,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=498, PETRI_PLACES=99, PETRI_TRANSITIONS=86} [2023-01-28 04:14:39,917 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 59 predicate places. [2023-01-28 04:14:39,917 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 86 transitions, 498 flow [2023-01-28 04:14:39,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 98.0) internal successors, (2940), 30 states have internal predecessors, (2940), 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-28 04:14:39,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:14:39,918 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] [2023-01-28 04:14:39,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-01-28 04:14:40,124 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-28 04:14:40,124 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:14:40,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:14:40,125 INFO L85 PathProgramCache]: Analyzing trace with hash -776649670, now seen corresponding path program 2 times [2023-01-28 04:14:40,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:14:40,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145238964] [2023-01-28 04:14:40,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:14:40,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:14:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:14:40,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 04:14:40,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:14:40,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145238964] [2023-01-28 04:14:40,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145238964] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:14:40,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:14:40,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 04:14:40,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437453228] [2023-01-28 04:14:40,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:14:40,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 04:14:40,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:14:40,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 04:14:40,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 04:14:40,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 296 [2023-01-28 04:14:40,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 86 transitions, 498 flow. Second operand has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 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-28 04:14:40,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:14:40,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 296 [2023-01-28 04:14:40,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:14:41,514 INFO L130 PetriNetUnfolder]: 9630/13442 cut-off events. [2023-01-28 04:14:41,514 INFO L131 PetriNetUnfolder]: For 68859/70453 co-relation queries the response was YES. [2023-01-28 04:14:41,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52345 conditions, 13442 events. 9630/13442 cut-off events. For 68859/70453 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 72782 event pairs, 864 based on Foata normal form. 1595/14187 useless extension candidates. Maximal degree in co-relation 52298. Up to 7235 conditions per place. [2023-01-28 04:14:41,567 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 93 selfloop transitions, 2 changer transitions 160/256 dead transitions. [2023-01-28 04:14:41,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 256 transitions, 2064 flow [2023-01-28 04:14:41,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:14:41,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:14:41,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 747 transitions. [2023-01-28 04:14:41,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047297297297297 [2023-01-28 04:14:41,569 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 747 transitions. [2023-01-28 04:14:41,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 747 transitions. [2023-01-28 04:14:41,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:14:41,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 747 transitions. [2023-01-28 04:14:41,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 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-28 04:14:41,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 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-28 04:14:41,573 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 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-28 04:14:41,573 INFO L175 Difference]: Start difference. First operand has 99 places, 86 transitions, 498 flow. Second operand 5 states and 747 transitions. [2023-01-28 04:14:41,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 256 transitions, 2064 flow [2023-01-28 04:14:41,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 256 transitions, 1985 flow, removed 38 selfloop flow, removed 17 redundant places. [2023-01-28 04:14:41,658 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 301 flow [2023-01-28 04:14:41,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2023-01-28 04:14:41,660 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2023-01-28 04:14:41,660 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 301 flow [2023-01-28 04:14:41,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 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-28 04:14:41,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:14:41,660 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] [2023-01-28 04:14:41,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 04:14:41,661 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:14:41,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:14:41,661 INFO L85 PathProgramCache]: Analyzing trace with hash -421841092, now seen corresponding path program 3 times [2023-01-28 04:14:41,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:14:41,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015642480] [2023-01-28 04:14:41,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:14:41,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:14:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:14:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:14:42,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:14:42,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015642480] [2023-01-28 04:14:42,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015642480] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:14:42,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940051687] [2023-01-28 04:14:42,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 04:14:42,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:14:42,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:14:42,076 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-28 04:14:42,108 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-28 04:14:42,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-28 04:14:42,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:14:42,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-28 04:14:42,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:14:42,321 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-28 04:14:42,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 04:14:42,371 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-28 04:14:42,435 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-28 04:14:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 04:14:42,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:14:48,930 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_284 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_284) c_~A~0.base) c_~A~0.offset))) (or (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2023-01-28 04:14:48,937 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 04:14:48,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 45 [2023-01-28 04:14:48,939 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 78 treesize of output 72 [2023-01-28 04:14:48,944 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 26 treesize of output 24 [2023-01-28 04:14:48,946 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 29 treesize of output 23 [2023-01-28 04:14:48,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 04:14:48,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940051687] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:14:48,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:14:48,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 11] total 26 [2023-01-28 04:14:48,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475292647] [2023-01-28 04:14:48,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:14:48,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-01-28 04:14:48,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:14:48,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-01-28 04:14:48,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=562, Unknown=9, NotChecked=50, Total=756 [2023-01-28 04:14:48,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 296 [2023-01-28 04:14:48,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 61 transitions, 301 flow. Second operand has 28 states, 28 states have (on average 103.0) internal successors, (2884), 28 states have internal predecessors, (2884), 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-28 04:14:48,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:14:48,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 296 [2023-01-28 04:14:48,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:14:55,911 INFO L130 PetriNetUnfolder]: 24993/34453 cut-off events. [2023-01-28 04:14:55,912 INFO L131 PetriNetUnfolder]: For 191930/191930 co-relation queries the response was YES. [2023-01-28 04:14:56,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136650 conditions, 34453 events. 24993/34453 cut-off events. For 191930/191930 co-relation queries the response was YES. Maximal size of possible extension queue 1239. Compared 199011 event pairs, 1322 based on Foata normal form. 20/31888 useless extension candidates. Maximal degree in co-relation 136616. Up to 7291 conditions per place. [2023-01-28 04:14:56,108 INFO L137 encePairwiseOnDemand]: 283/296 looper letters, 388 selfloop transitions, 177 changer transitions 760/1325 dead transitions. [2023-01-28 04:14:56,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 1325 transitions, 9162 flow [2023-01-28 04:14:56,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-01-28 04:14:56,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2023-01-28 04:14:56,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 9798 transitions. [2023-01-28 04:14:56,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.380475302889096 [2023-01-28 04:14:56,126 INFO L72 ComplementDD]: Start complementDD. Operand 87 states and 9798 transitions. [2023-01-28 04:14:56,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 9798 transitions. [2023-01-28 04:14:56,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:14:56,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 87 states and 9798 transitions. [2023-01-28 04:14:56,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 88 states, 87 states have (on average 112.62068965517241) internal successors, (9798), 87 states have internal predecessors, (9798), 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-28 04:14:56,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 88 states, 88 states have (on average 296.0) internal successors, (26048), 88 states have internal predecessors, (26048), 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-28 04:14:56,182 INFO L81 ComplementDD]: Finished complementDD. Result has 88 states, 88 states have (on average 296.0) internal successors, (26048), 88 states have internal predecessors, (26048), 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-28 04:14:56,183 INFO L175 Difference]: Start difference. First operand has 73 places, 61 transitions, 301 flow. Second operand 87 states and 9798 transitions. [2023-01-28 04:14:56,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 1325 transitions, 9162 flow [2023-01-28 04:14:57,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 1325 transitions, 8285 flow, removed 408 selfloop flow, removed 10 redundant places. [2023-01-28 04:14:57,968 INFO L231 Difference]: Finished difference. Result has 211 places, 233 transitions, 2150 flow [2023-01-28 04:14:57,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=87, PETRI_FLOW=2150, PETRI_PLACES=211, PETRI_TRANSITIONS=233} [2023-01-28 04:14:57,969 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 171 predicate places. [2023-01-28 04:14:57,969 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 233 transitions, 2150 flow [2023-01-28 04:14:57,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 103.0) internal successors, (2884), 28 states have internal predecessors, (2884), 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-28 04:14:57,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:14:57,971 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] [2023-01-28 04:14:57,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-28 04:14:58,177 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,SelfDestructingSolverStorable6 [2023-01-28 04:14:58,177 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:14:58,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:14:58,178 INFO L85 PathProgramCache]: Analyzing trace with hash -551404586, now seen corresponding path program 4 times [2023-01-28 04:14:58,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:14:58,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565509562] [2023-01-28 04:14:58,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:14:58,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:14:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:14:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:14:59,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:14:59,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565509562] [2023-01-28 04:14:59,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565509562] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:14:59,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569166372] [2023-01-28 04:14:59,035 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 04:14:59,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:14:59,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:14:59,036 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-28 04:14:59,055 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-28 04:14:59,138 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 04:14:59,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:14:59,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-28 04:14:59,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:14:59,148 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 894 treesize of output 862 [2023-01-28 04:14:59,214 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 14 treesize of output 16 [2023-01-28 04:14:59,234 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-28 04:14:59,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-01-28 04:14:59,296 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 17 treesize of output 9 [2023-01-28 04:14:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 04:14:59,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:15:02,227 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 247 treesize of output 215 [2023-01-28 04:15:02,233 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 41 treesize of output 37 [2023-01-28 04:15:02,236 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 53 treesize of output 45 [2023-01-28 04:15:02,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 04:15:02,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569166372] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:15:02,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:15:02,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30 [2023-01-28 04:15:02,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366884947] [2023-01-28 04:15:02,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:15:02,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-01-28 04:15:02,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:15:02,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-01-28 04:15:02,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=798, Unknown=22, NotChecked=0, Total=992 [2023-01-28 04:15:02,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 296 [2023-01-28 04:15:02,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 233 transitions, 2150 flow. Second operand has 32 states, 32 states have (on average 94.5) internal successors, (3024), 32 states have internal predecessors, (3024), 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-28 04:15:02,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:15:02,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 296 [2023-01-28 04:15:02,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:15:10,698 WARN L222 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 59 DAG size of output: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 04:15:39,948 WARN L222 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 74 DAG size of output: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 04:15:45,502 WARN L222 SmtUtils]: Spent 5.31s on a formula simplification. DAG size of input: 64 DAG size of output: 39 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 04:17:15,983 INFO L130 PetriNetUnfolder]: 46739/65136 cut-off events. [2023-01-28 04:17:15,984 INFO L131 PetriNetUnfolder]: For 4923944/4923944 co-relation queries the response was YES. [2023-01-28 04:17:17,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624230 conditions, 65136 events. 46739/65136 cut-off events. For 4923944/4923944 co-relation queries the response was YES. Maximal size of possible extension queue 2395. Compared 418459 event pairs, 1872 based on Foata normal form. 35/65170 useless extension candidates. Maximal degree in co-relation 624132. Up to 17165 conditions per place. [2023-01-28 04:17:17,664 INFO L137 encePairwiseOnDemand]: 283/296 looper letters, 532 selfloop transitions, 475 changer transitions 1128/2135 dead transitions. [2023-01-28 04:17:17,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 2135 transitions, 32125 flow [2023-01-28 04:17:17,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2023-01-28 04:17:17,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2023-01-28 04:17:17,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 13204 transitions. [2023-01-28 04:17:17,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3512449457331347 [2023-01-28 04:17:17,702 INFO L72 ComplementDD]: Start complementDD. Operand 127 states and 13204 transitions. [2023-01-28 04:17:17,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 13204 transitions. [2023-01-28 04:17:17,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:17:17,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 127 states and 13204 transitions. [2023-01-28 04:17:17,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 128 states, 127 states have (on average 103.96850393700787) internal successors, (13204), 127 states have internal predecessors, (13204), 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-28 04:17:17,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 128 states, 128 states have (on average 296.0) internal successors, (37888), 128 states have internal predecessors, (37888), 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-28 04:17:17,835 INFO L81 ComplementDD]: Finished complementDD. Result has 128 states, 128 states have (on average 296.0) internal successors, (37888), 128 states have internal predecessors, (37888), 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-28 04:17:17,836 INFO L175 Difference]: Start difference. First operand has 211 places, 233 transitions, 2150 flow. Second operand 127 states and 13204 transitions. [2023-01-28 04:17:17,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 2135 transitions, 32125 flow [2023-01-28 04:18:12,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 2135 transitions, 21452 flow, removed 5210 selfloop flow, removed 43 redundant places. [2023-01-28 04:18:12,661 INFO L231 Difference]: Finished difference. Result has 351 places, 549 transitions, 7180 flow [2023-01-28 04:18:12,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=1933, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=127, PETRI_FLOW=7180, PETRI_PLACES=351, PETRI_TRANSITIONS=549} [2023-01-28 04:18:12,662 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 311 predicate places. [2023-01-28 04:18:12,662 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 549 transitions, 7180 flow [2023-01-28 04:18:12,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 94.5) internal successors, (3024), 32 states have internal predecessors, (3024), 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-28 04:18:12,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:18:12,663 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] [2023-01-28 04:18:12,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-01-28 04:18:12,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:18:12,870 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:18:12,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:18:12,870 INFO L85 PathProgramCache]: Analyzing trace with hash -870441776, now seen corresponding path program 5 times [2023-01-28 04:18:12,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:18:12,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690602071] [2023-01-28 04:18:12,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:18:12,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:18:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:18:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 04:18:13,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:18:13,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690602071] [2023-01-28 04:18:13,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690602071] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:18:13,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:18:13,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 04:18:13,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891139793] [2023-01-28 04:18:13,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:18:13,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 04:18:13,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:18:13,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 04:18:13,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 04:18:13,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 296 [2023-01-28 04:18:13,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 549 transitions, 7180 flow. Second operand has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 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-28 04:18:13,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:18:13,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 296 [2023-01-28 04:18:13,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:18:27,294 INFO L130 PetriNetUnfolder]: 36956/52628 cut-off events. [2023-01-28 04:18:27,295 INFO L131 PetriNetUnfolder]: For 8242088/8244824 co-relation queries the response was YES. [2023-01-28 04:18:28,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621363 conditions, 52628 events. 36956/52628 cut-off events. For 8242088/8244824 co-relation queries the response was YES. Maximal size of possible extension queue 2087. Compared 344625 event pairs, 10277 based on Foata normal form. 2150/54610 useless extension candidates. Maximal degree in co-relation 621194. Up to 40021 conditions per place. [2023-01-28 04:18:29,022 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 504 selfloop transitions, 38 changer transitions 410/990 dead transitions. [2023-01-28 04:18:29,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 990 transitions, 15337 flow [2023-01-28 04:18:29,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:18:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:18:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 741 transitions. [2023-01-28 04:18:29,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5006756756756757 [2023-01-28 04:18:29,025 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 741 transitions. [2023-01-28 04:18:29,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 741 transitions. [2023-01-28 04:18:29,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:18:29,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 741 transitions. [2023-01-28 04:18:29,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.2) internal successors, (741), 5 states have internal predecessors, (741), 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-28 04:18:29,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 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-28 04:18:29,027 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 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-28 04:18:29,027 INFO L175 Difference]: Start difference. First operand has 351 places, 549 transitions, 7180 flow. Second operand 5 states and 741 transitions. [2023-01-28 04:18:29,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 990 transitions, 15337 flow [2023-01-28 04:19:36,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 990 transitions, 14132 flow, removed 568 selfloop flow, removed 77 redundant places. [2023-01-28 04:19:36,434 INFO L231 Difference]: Finished difference. Result has 200 places, 521 transitions, 6411 flow [2023-01-28 04:19:36,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=6647, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6411, PETRI_PLACES=200, PETRI_TRANSITIONS=521} [2023-01-28 04:19:36,434 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 160 predicate places. [2023-01-28 04:19:36,434 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 521 transitions, 6411 flow [2023-01-28 04:19:36,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 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-28 04:19:36,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:19:36,435 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] [2023-01-28 04:19:36,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 04:19:36,435 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:19:36,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:19:36,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1301239454, now seen corresponding path program 6 times [2023-01-28 04:19:36,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:19:36,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292759507] [2023-01-28 04:19:36,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:19:36,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:19:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:19:36,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 04:19:36,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:19:36,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292759507] [2023-01-28 04:19:36,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292759507] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:19:36,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923497931] [2023-01-28 04:19:36,846 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 04:19:36,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:19:36,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:19:36,853 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-28 04:19:36,878 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-28 04:19:36,962 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-28 04:19:36,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:19:36,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 43 conjunts are in the unsatisfiable core [2023-01-28 04:19:36,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:19:37,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 04:19:37,092 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-28 04:19:37,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 04:19:37,145 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-28 04:19:37,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 04:19:37,168 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-28 04:19:37,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 19 [2023-01-28 04:19:37,285 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 43 treesize of output 27 [2023-01-28 04:19:37,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 04:19:37,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:19:37,617 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_455 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_455) c_~A~0.base) c_~A~0.offset))) (or (< 2147483646 .cse0) (< c_~min~0 (+ 2 .cse0))))) is different from false [2023-01-28 04:19:43,035 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 535 treesize of output 471 [2023-01-28 04:19:43,043 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 221 treesize of output 205 [2023-01-28 04:19:43,049 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 97 treesize of output 93 [2023-01-28 04:19:43,055 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 109 treesize of output 101 [2023-01-28 04:19:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 04:19:43,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923497931] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:19:43,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:19:43,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 31 [2023-01-28 04:19:43,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713024531] [2023-01-28 04:19:43,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:19:43,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-01-28 04:19:43,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:19:43,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-01-28 04:19:43,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=814, Unknown=18, NotChecked=60, Total=1056 [2023-01-28 04:19:43,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 296 [2023-01-28 04:19:43,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 521 transitions, 6411 flow. Second operand has 33 states, 33 states have (on average 96.63636363636364) internal successors, (3189), 33 states have internal predecessors, (3189), 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-28 04:19:43,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:19:43,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 296 [2023-01-28 04:19:43,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:19:59,624 INFO L130 PetriNetUnfolder]: 45846/64594 cut-off events. [2023-01-28 04:19:59,624 INFO L131 PetriNetUnfolder]: For 2749599/2749599 co-relation queries the response was YES. [2023-01-28 04:20:00,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488267 conditions, 64594 events. 45846/64594 cut-off events. For 2749599/2749599 co-relation queries the response was YES. Maximal size of possible extension queue 2384. Compared 423067 event pairs, 4967 based on Foata normal form. 29/64622 useless extension candidates. Maximal degree in co-relation 488171. Up to 17095 conditions per place. [2023-01-28 04:20:00,800 INFO L137 encePairwiseOnDemand]: 285/296 looper letters, 339 selfloop transitions, 415 changer transitions 576/1330 dead transitions. [2023-01-28 04:20:00,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 1330 transitions, 19334 flow [2023-01-28 04:20:00,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-01-28 04:20:00,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-01-28 04:20:00,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 4992 transitions. [2023-01-28 04:20:00,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588269120184014 [2023-01-28 04:20:00,805 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 4992 transitions. [2023-01-28 04:20:00,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 4992 transitions. [2023-01-28 04:20:00,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:20:00,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 4992 transitions. [2023-01-28 04:20:00,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 106.2127659574468) internal successors, (4992), 47 states have internal predecessors, (4992), 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-28 04:20:00,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 296.0) internal successors, (14208), 48 states have internal predecessors, (14208), 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-28 04:20:00,819 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 296.0) internal successors, (14208), 48 states have internal predecessors, (14208), 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-28 04:20:00,819 INFO L175 Difference]: Start difference. First operand has 200 places, 521 transitions, 6411 flow. Second operand 47 states and 4992 transitions. [2023-01-28 04:20:00,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 1330 transitions, 19334 flow [2023-01-28 04:20:25,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 1330 transitions, 18406 flow, removed 437 selfloop flow, removed 5 redundant places. [2023-01-28 04:20:25,926 INFO L231 Difference]: Finished difference. Result has 272 places, 559 transitions, 8374 flow [2023-01-28 04:20:25,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=6318, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=364, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=8374, PETRI_PLACES=272, PETRI_TRANSITIONS=559} [2023-01-28 04:20:25,927 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 232 predicate places. [2023-01-28 04:20:25,927 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 559 transitions, 8374 flow [2023-01-28 04:20:25,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 96.63636363636364) internal successors, (3189), 33 states have internal predecessors, (3189), 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-28 04:20:25,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:20:25,928 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] [2023-01-28 04:20:25,934 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-28 04:20:26,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:20:26,133 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:20:26,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:20:26,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2047246626, now seen corresponding path program 7 times [2023-01-28 04:20:26,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:20:26,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800131229] [2023-01-28 04:20:26,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:20:26,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:20:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:20:26,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 04:20:26,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:20:26,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800131229] [2023-01-28 04:20:26,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800131229] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:20:26,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130361495] [2023-01-28 04:20:26,306 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 04:20:26,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:20:26,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:20:26,307 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-28 04:20:26,309 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-28 04:20:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:20:26,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 17 conjunts are in the unsatisfiable core [2023-01-28 04:20:26,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:20:26,438 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-28 04:20:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 04:20:26,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:20:26,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 04:20:26,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130361495] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 04:20:26,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 04:20:26,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 14 [2023-01-28 04:20:26,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309202833] [2023-01-28 04:20:26,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:20:26,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 04:20:26,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:20:26,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 04:20:26,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-01-28 04:20:26,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 296 [2023-01-28 04:20:26,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 559 transitions, 8374 flow. Second operand has 6 states, 6 states have (on average 120.0) internal successors, (720), 6 states have internal predecessors, (720), 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-28 04:20:26,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:20:26,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 296 [2023-01-28 04:20:26,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:20:43,653 INFO L130 PetriNetUnfolder]: 56407/79873 cut-off events. [2023-01-28 04:20:43,653 INFO L131 PetriNetUnfolder]: For 6525198/6527811 co-relation queries the response was YES. [2023-01-28 04:20:45,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731246 conditions, 79873 events. 56407/79873 cut-off events. For 6525198/6527811 co-relation queries the response was YES. Maximal size of possible extension queue 3112. Compared 549181 event pairs, 13366 based on Foata normal form. 2256/82051 useless extension candidates. Maximal degree in co-relation 731119. Up to 41283 conditions per place. [2023-01-28 04:20:45,834 INFO L137 encePairwiseOnDemand]: 285/296 looper letters, 776 selfloop transitions, 229 changer transitions 128/1167 dead transitions. [2023-01-28 04:20:45,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 1167 transitions, 19796 flow [2023-01-28 04:20:45,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 04:20:45,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 04:20:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1063 transitions. [2023-01-28 04:20:45,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44890202702702703 [2023-01-28 04:20:45,835 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1063 transitions. [2023-01-28 04:20:45,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1063 transitions. [2023-01-28 04:20:45,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:20:45,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1063 transitions. [2023-01-28 04:20:45,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.875) internal successors, (1063), 8 states have internal predecessors, (1063), 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-28 04:20:45,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 296.0) internal successors, (2664), 9 states have internal predecessors, (2664), 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-28 04:20:45,838 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 296.0) internal successors, (2664), 9 states have internal predecessors, (2664), 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-28 04:20:45,838 INFO L175 Difference]: Start difference. First operand has 272 places, 559 transitions, 8374 flow. Second operand 8 states and 1063 transitions. [2023-01-28 04:20:45,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 1167 transitions, 19796 flow [2023-01-28 04:21:41,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 1167 transitions, 18331 flow, removed 250 selfloop flow, removed 38 redundant places. [2023-01-28 04:21:41,527 INFO L231 Difference]: Finished difference. Result has 217 places, 730 transitions, 10845 flow [2023-01-28 04:21:41,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=7781, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10845, PETRI_PLACES=217, PETRI_TRANSITIONS=730} [2023-01-28 04:21:41,528 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 177 predicate places. [2023-01-28 04:21:41,528 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 730 transitions, 10845 flow [2023-01-28 04:21:41,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.0) internal successors, (720), 6 states have internal predecessors, (720), 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-28 04:21:41,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:21:41,528 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] [2023-01-28 04:21:41,535 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-28 04:21:41,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-01-28 04:21:41,733 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:21:41,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:21:41,733 INFO L85 PathProgramCache]: Analyzing trace with hash 186363290, now seen corresponding path program 8 times [2023-01-28 04:21:41,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:21:41,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768529712] [2023-01-28 04:21:41,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:21:41,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:21:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:21:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:21:42,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:21:42,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768529712] [2023-01-28 04:21:42,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768529712] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:21:42,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300173821] [2023-01-28 04:21:42,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 04:21:42,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:21:42,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:21:42,029 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-28 04:21:42,031 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-28 04:21:42,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 04:21:42,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:21:42,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 33 conjunts are in the unsatisfiable core [2023-01-28 04:21:42,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:21:42,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 04:21:42,442 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-28 04:21:42,487 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-28 04:21:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:21:42,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:21:42,798 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 27 treesize of output 19 [2023-01-28 04:21:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:21:42,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300173821] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 04:21:42,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 04:21:42,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8, 9] total 26 [2023-01-28 04:21:42,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093554312] [2023-01-28 04:21:42,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:21:42,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-28 04:21:42,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:21:42,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-28 04:21:42,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=610, Unknown=3, NotChecked=0, Total=756 [2023-01-28 04:21:42,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 296 [2023-01-28 04:21:42,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 730 transitions, 10845 flow. Second operand has 12 states, 12 states have (on average 107.5) internal successors, (1290), 12 states have internal predecessors, (1290), 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-28 04:21:42,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:21:42,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 296 [2023-01-28 04:21:42,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:22:14,376 INFO L130 PetriNetUnfolder]: 104485/147492 cut-off events. [2023-01-28 04:22:14,376 INFO L131 PetriNetUnfolder]: For 7619207/7623933 co-relation queries the response was YES. [2023-01-28 04:22:16,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1188932 conditions, 147492 events. 104485/147492 cut-off events. For 7619207/7623933 co-relation queries the response was YES. Maximal size of possible extension queue 5826. Compared 1083939 event pairs, 23497 based on Foata normal form. 4333/151691 useless extension candidates. Maximal degree in co-relation 1188827. Up to 43245 conditions per place. [2023-01-28 04:22:17,434 INFO L137 encePairwiseOnDemand]: 285/296 looper letters, 569 selfloop transitions, 197 changer transitions 1301/2087 dead transitions. [2023-01-28 04:22:17,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 2087 transitions, 35967 flow [2023-01-28 04:22:17,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 04:22:17,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 04:22:17,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1435 transitions. [2023-01-28 04:22:17,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40399774774774777 [2023-01-28 04:22:17,436 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1435 transitions. [2023-01-28 04:22:17,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1435 transitions. [2023-01-28 04:22:17,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:22:17,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1435 transitions. [2023-01-28 04:22:17,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 119.58333333333333) internal successors, (1435), 12 states have internal predecessors, (1435), 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-28 04:22:17,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 296.0) internal successors, (3848), 13 states have internal predecessors, (3848), 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-28 04:22:17,469 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 296.0) internal successors, (3848), 13 states have internal predecessors, (3848), 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-28 04:22:17,469 INFO L175 Difference]: Start difference. First operand has 217 places, 730 transitions, 10845 flow. Second operand 12 states and 1435 transitions. [2023-01-28 04:22:17,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 2087 transitions, 35967 flow [2023-01-28 04:24:12,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 2087 transitions, 35955 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-01-28 04:24:12,741 INFO L231 Difference]: Finished difference. Result has 234 places, 580 transitions, 9784 flow [2023-01-28 04:24:12,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=10841, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=533, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9784, PETRI_PLACES=234, PETRI_TRANSITIONS=580} [2023-01-28 04:24:12,743 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 194 predicate places. [2023-01-28 04:24:12,744 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 580 transitions, 9784 flow [2023-01-28 04:24:12,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 107.5) internal successors, (1290), 12 states have internal predecessors, (1290), 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-28 04:24:12,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:24:12,744 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] [2023-01-28 04:24:12,753 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-28 04:24:12,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:24:12,949 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:24:12,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:24:12,949 INFO L85 PathProgramCache]: Analyzing trace with hash 870778556, now seen corresponding path program 9 times [2023-01-28 04:24:12,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:24:12,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781250713] [2023-01-28 04:24:12,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:24:12,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:24:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:24:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:24:13,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:24:13,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781250713] [2023-01-28 04:24:13,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781250713] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:24:13,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663462911] [2023-01-28 04:24:13,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 04:24:13,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:24:13,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:24:13,365 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-28 04:24:13,367 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-28 04:24:13,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 04:24:13,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:24:13,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 33 conjunts are in the unsatisfiable core [2023-01-28 04:24:13,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:24:13,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 04:24:13,568 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-28 04:24:13,618 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-28 04:24:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 04:24:13,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:24:13,729 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 13 treesize of output 5 [2023-01-28 04:24:13,979 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 27 treesize of output 19 [2023-01-28 04:24:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:24:14,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663462911] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 04:24:14,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 04:24:14,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9, 10] total 29 [2023-01-28 04:24:14,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960287655] [2023-01-28 04:24:14,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:24:14,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-28 04:24:14,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:24:14,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-28 04:24:14,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=748, Unknown=9, NotChecked=0, Total=930 [2023-01-28 04:24:14,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 296 [2023-01-28 04:24:14,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 580 transitions, 9784 flow. Second operand has 12 states, 12 states have (on average 107.5) internal successors, (1290), 12 states have internal predecessors, (1290), 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-28 04:24:14,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:24:14,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 296 [2023-01-28 04:24:14,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:24:33,553 INFO L130 PetriNetUnfolder]: 67055/94976 cut-off events. [2023-01-28 04:24:33,553 INFO L131 PetriNetUnfolder]: For 5863921/5866347 co-relation queries the response was YES. [2023-01-28 04:24:35,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811908 conditions, 94976 events. 67055/94976 cut-off events. For 5863921/5866347 co-relation queries the response was YES. Maximal size of possible extension queue 3613. Compared 661705 event pairs, 15262 based on Foata normal form. 2243/97146 useless extension candidates. Maximal degree in co-relation 811793. Up to 25494 conditions per place. [2023-01-28 04:24:35,434 INFO L137 encePairwiseOnDemand]: 285/296 looper letters, 463 selfloop transitions, 116 changer transitions 922/1521 dead transitions. [2023-01-28 04:24:35,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 1521 transitions, 29188 flow [2023-01-28 04:24:35,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 04:24:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 04:24:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1429 transitions. [2023-01-28 04:24:35,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40230855855855857 [2023-01-28 04:24:35,436 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1429 transitions. [2023-01-28 04:24:35,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1429 transitions. [2023-01-28 04:24:35,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:24:35,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1429 transitions. [2023-01-28 04:24:35,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 119.08333333333333) internal successors, (1429), 12 states have internal predecessors, (1429), 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-28 04:24:35,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 296.0) internal successors, (3848), 13 states have internal predecessors, (3848), 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-28 04:24:35,459 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 296.0) internal successors, (3848), 13 states have internal predecessors, (3848), 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-28 04:24:35,459 INFO L175 Difference]: Start difference. First operand has 234 places, 580 transitions, 9784 flow. Second operand 12 states and 1429 transitions. [2023-01-28 04:24:35,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 1521 transitions, 29188 flow [2023-01-28 04:25:31,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 1521 transitions, 27945 flow, removed 387 selfloop flow, removed 25 redundant places. [2023-01-28 04:25:31,533 INFO L231 Difference]: Finished difference. Result has 224 places, 454 transitions, 7909 flow [2023-01-28 04:25:31,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=9441, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7909, PETRI_PLACES=224, PETRI_TRANSITIONS=454} [2023-01-28 04:25:31,534 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 184 predicate places. [2023-01-28 04:25:31,534 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 454 transitions, 7909 flow [2023-01-28 04:25:31,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 107.5) internal successors, (1290), 12 states have internal predecessors, (1290), 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-28 04:25:31,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:25:31,535 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] [2023-01-28 04:25:31,543 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-28 04:25:31,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:25:31,743 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:25:31,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:25:31,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1030603632, now seen corresponding path program 10 times [2023-01-28 04:25:31,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:25:31,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497363498] [2023-01-28 04:25:31,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:25:31,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:25:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:25:32,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 04:25:32,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:25:32,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497363498] [2023-01-28 04:25:32,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497363498] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:25:32,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328692943] [2023-01-28 04:25:32,054 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 04:25:32,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:25:32,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:25:32,055 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 04:25:32,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-28 04:25:32,156 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 04:25:32,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:25:32,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 34 conjunts are in the unsatisfiable core [2023-01-28 04:25:32,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:25:32,164 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 426 treesize of output 410 [2023-01-28 04:25:32,276 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 14 treesize of output 16 [2023-01-28 04:25:32,302 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-28 04:25:32,356 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-28 04:25:32,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:25:32,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:25:33,312 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 69 treesize of output 53 [2023-01-28 04:25:33,315 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 46 treesize of output 42 [2023-01-28 04:25:33,320 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 26 treesize of output 24 [2023-01-28 04:25:33,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:25:33,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328692943] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:25:33,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:25:33,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 28 [2023-01-28 04:25:33,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42960167] [2023-01-28 04:25:33,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:25:33,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-28 04:25:33,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:25:33,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-28 04:25:33,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=696, Unknown=15, NotChecked=0, Total=870 [2023-01-28 04:25:33,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 296 [2023-01-28 04:25:33,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 454 transitions, 7909 flow. Second operand has 30 states, 30 states have (on average 99.9) internal successors, (2997), 30 states have internal predecessors, (2997), 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-28 04:25:33,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:25:33,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 296 [2023-01-28 04:25:33,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:25:48,192 INFO L130 PetriNetUnfolder]: 53163/75321 cut-off events. [2023-01-28 04:25:48,192 INFO L131 PetriNetUnfolder]: For 3117775/3117775 co-relation queries the response was YES. [2023-01-28 04:25:49,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588518 conditions, 75321 events. 53163/75321 cut-off events. For 3117775/3117775 co-relation queries the response was YES. Maximal size of possible extension queue 2809. Compared 506833 event pairs, 3610 based on Foata normal form. 79/75399 useless extension candidates. Maximal degree in co-relation 588417. Up to 20076 conditions per place. [2023-01-28 04:25:49,384 INFO L137 encePairwiseOnDemand]: 285/296 looper letters, 385 selfloop transitions, 83 changer transitions 1008/1476 dead transitions. [2023-01-28 04:25:49,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 1476 transitions, 27804 flow [2023-01-28 04:25:49,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-01-28 04:25:49,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-01-28 04:25:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 5185 transitions. [2023-01-28 04:25:49,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36493524774774777 [2023-01-28 04:25:49,389 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 5185 transitions. [2023-01-28 04:25:49,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 5185 transitions. [2023-01-28 04:25:49,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:25:49,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 5185 transitions. [2023-01-28 04:25:49,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 108.02083333333333) internal successors, (5185), 48 states have internal predecessors, (5185), 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-28 04:25:49,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 296.0) internal successors, (14504), 49 states have internal predecessors, (14504), 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-28 04:25:49,446 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 296.0) internal successors, (14504), 49 states have internal predecessors, (14504), 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-28 04:25:49,447 INFO L175 Difference]: Start difference. First operand has 224 places, 454 transitions, 7909 flow. Second operand 48 states and 5185 transitions. [2023-01-28 04:25:49,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 1476 transitions, 27804 flow [2023-01-28 04:26:04,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 1476 transitions, 27527 flow, removed 134 selfloop flow, removed 6 redundant places. [2023-01-28 04:26:04,484 INFO L231 Difference]: Finished difference. Result has 301 places, 345 transitions, 6614 flow [2023-01-28 04:26:04,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=7874, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=6614, PETRI_PLACES=301, PETRI_TRANSITIONS=345} [2023-01-28 04:26:04,485 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 261 predicate places. [2023-01-28 04:26:04,485 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 345 transitions, 6614 flow [2023-01-28 04:26:04,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 99.9) internal successors, (2997), 30 states have internal predecessors, (2997), 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-28 04:26:04,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:26:04,485 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] [2023-01-28 04:26:04,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-28 04:26:04,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-01-28 04:26:04,690 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:26:04,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:26:04,690 INFO L85 PathProgramCache]: Analyzing trace with hash -793896260, now seen corresponding path program 11 times [2023-01-28 04:26:04,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:26:04,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795270000] [2023-01-28 04:26:04,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:26:04,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:26:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:26:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:26:04,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:26:04,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795270000] [2023-01-28 04:26:04,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795270000] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:26:04,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712802986] [2023-01-28 04:26:04,768 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 04:26:04,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:26:04,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:26:04,782 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 04:26:04,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-28 04:26:04,900 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 04:26:04,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:26:04,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-28 04:26:04,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:26:04,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:26:04,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:26:05,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:26:05,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712802986] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:26:05,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:26:05,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-01-28 04:26:05,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126596648] [2023-01-28 04:26:05,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:26:05,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-28 04:26:05,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:26:05,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-28 04:26:05,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-01-28 04:26:05,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 296 [2023-01-28 04:26:05,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 345 transitions, 6614 flow. Second operand has 14 states, 14 states have (on average 119.35714285714286) internal successors, (1671), 14 states have internal predecessors, (1671), 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-28 04:26:05,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:26:05,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 296 [2023-01-28 04:26:05,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:26:11,245 INFO L130 PetriNetUnfolder]: 20974/30557 cut-off events. [2023-01-28 04:26:11,245 INFO L131 PetriNetUnfolder]: For 2542978/2542978 co-relation queries the response was YES. [2023-01-28 04:26:11,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307618 conditions, 30557 events. 20974/30557 cut-off events. For 2542978/2542978 co-relation queries the response was YES. Maximal size of possible extension queue 1090. Compared 192995 event pairs, 4608 based on Foata normal form. 211/30766 useless extension candidates. Maximal degree in co-relation 307495. Up to 14637 conditions per place. [2023-01-28 04:26:11,840 INFO L137 encePairwiseOnDemand]: 290/296 looper letters, 431 selfloop transitions, 4 changer transitions 207/642 dead transitions. [2023-01-28 04:26:11,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 642 transitions, 13079 flow [2023-01-28 04:26:11,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 04:26:11,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 04:26:11,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1014 transitions. [2023-01-28 04:26:11,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4282094594594595 [2023-01-28 04:26:11,841 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1014 transitions. [2023-01-28 04:26:11,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1014 transitions. [2023-01-28 04:26:11,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:26:11,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1014 transitions. [2023-01-28 04:26:11,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.75) internal successors, (1014), 8 states have internal predecessors, (1014), 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-28 04:26:11,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 296.0) internal successors, (2664), 9 states have internal predecessors, (2664), 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-28 04:26:11,844 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 296.0) internal successors, (2664), 9 states have internal predecessors, (2664), 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-28 04:26:11,844 INFO L175 Difference]: Start difference. First operand has 301 places, 345 transitions, 6614 flow. Second operand 8 states and 1014 transitions. [2023-01-28 04:26:11,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 642 transitions, 13079 flow [2023-01-28 04:26:19,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 642 transitions, 10962 flow, removed 905 selfloop flow, removed 49 redundant places. [2023-01-28 04:26:19,158 INFO L231 Difference]: Finished difference. Result has 196 places, 346 transitions, 5748 flow [2023-01-28 04:26:19,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=5536, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5748, PETRI_PLACES=196, PETRI_TRANSITIONS=346} [2023-01-28 04:26:19,159 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 156 predicate places. [2023-01-28 04:26:19,159 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 346 transitions, 5748 flow [2023-01-28 04:26:19,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 119.35714285714286) internal successors, (1671), 14 states have internal predecessors, (1671), 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-28 04:26:19,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:26:19,159 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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] [2023-01-28 04:26:19,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-01-28 04:26:19,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-01-28 04:26:19,364 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:26:19,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:26:19,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1994142562, now seen corresponding path program 12 times [2023-01-28 04:26:19,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:26:19,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688529782] [2023-01-28 04:26:19,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:26:19,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:26:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:26:19,453 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 04:26:19,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:26:19,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688529782] [2023-01-28 04:26:19,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688529782] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:26:19,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176235964] [2023-01-28 04:26:19,454 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 04:26:19,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:26:19,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:26:19,463 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 04:26:19,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-28 04:26:19,589 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-28 04:26:19,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:26:19,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-28 04:26:19,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:26:19,640 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 04:26:19,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:26:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 04:26:19,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176235964] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:26:19,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:26:19,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2023-01-28 04:26:19,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054413962] [2023-01-28 04:26:19,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:26:19,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-28 04:26:19,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:26:19,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-28 04:26:19,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-01-28 04:26:19,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 296 [2023-01-28 04:26:19,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 346 transitions, 5748 flow. Second operand has 15 states, 15 states have (on average 119.0) internal successors, (1785), 15 states have internal predecessors, (1785), 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-28 04:26:19,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:26:19,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 296 [2023-01-28 04:26:19,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:26:25,494 INFO L130 PetriNetUnfolder]: 24819/35244 cut-off events. [2023-01-28 04:26:25,495 INFO L131 PetriNetUnfolder]: For 1522101/1522372 co-relation queries the response was YES. [2023-01-28 04:26:26,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309383 conditions, 35244 events. 24819/35244 cut-off events. For 1522101/1522372 co-relation queries the response was YES. Maximal size of possible extension queue 1358. Compared 216325 event pairs, 8697 based on Foata normal form. 2365/37592 useless extension candidates. Maximal degree in co-relation 309295. Up to 24995 conditions per place. [2023-01-28 04:26:26,418 INFO L137 encePairwiseOnDemand]: 291/296 looper letters, 405 selfloop transitions, 85 changer transitions 0/504 dead transitions. [2023-01-28 04:26:26,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 504 transitions, 9662 flow [2023-01-28 04:26:26,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 04:26:26,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 04:26:26,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 875 transitions. [2023-01-28 04:26:26,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222972972972973 [2023-01-28 04:26:26,419 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 875 transitions. [2023-01-28 04:26:26,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 875 transitions. [2023-01-28 04:26:26,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:26:26,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 875 transitions. [2023-01-28 04:26:26,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:26:26,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 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-28 04:26:26,422 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 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-28 04:26:26,422 INFO L175 Difference]: Start difference. First operand has 196 places, 346 transitions, 5748 flow. Second operand 7 states and 875 transitions. [2023-01-28 04:26:26,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 504 transitions, 9662 flow [2023-01-28 04:26:36,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 504 transitions, 9017 flow, removed 319 selfloop flow, removed 23 redundant places. [2023-01-28 04:26:36,740 INFO L231 Difference]: Finished difference. Result has 177 places, 347 transitions, 5619 flow [2023-01-28 04:26:36,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=5375, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5619, PETRI_PLACES=177, PETRI_TRANSITIONS=347} [2023-01-28 04:26:36,740 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 137 predicate places. [2023-01-28 04:26:36,740 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 347 transitions, 5619 flow [2023-01-28 04:26:36,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 119.0) internal successors, (1785), 15 states have internal predecessors, (1785), 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-28 04:26:36,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:26:36,741 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 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] [2023-01-28 04:26:36,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-28 04:26:36,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-01-28 04:26:36,945 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:26:36,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:26:36,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1061762819, now seen corresponding path program 13 times [2023-01-28 04:26:36,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:26:36,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129575436] [2023-01-28 04:26:36,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:26:36,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:26:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:26:37,037 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 04:26:37,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:26:37,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129575436] [2023-01-28 04:26:37,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129575436] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:26:37,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571905653] [2023-01-28 04:26:37,037 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 04:26:37,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:26:37,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:26:37,038 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 04:26:37,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-28 04:26:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:26:37,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-28 04:26:37,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:26:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 04:26:37,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:26:37,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 04:26:37,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571905653] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:26:37,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:26:37,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2023-01-28 04:26:37,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697881628] [2023-01-28 04:26:37,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:26:37,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-28 04:26:37,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:26:37,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-28 04:26:37,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-01-28 04:26:37,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 296 [2023-01-28 04:26:37,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 347 transitions, 5619 flow. Second operand has 15 states, 15 states have (on average 118.86666666666666) internal successors, (1783), 15 states have internal predecessors, (1783), 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-28 04:26:37,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:26:37,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 296 [2023-01-28 04:26:37,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:26:43,414 INFO L130 PetriNetUnfolder]: 27944/39466 cut-off events. [2023-01-28 04:26:43,414 INFO L131 PetriNetUnfolder]: For 716048/716318 co-relation queries the response was YES. [2023-01-28 04:26:43,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285964 conditions, 39466 events. 27944/39466 cut-off events. For 716048/716318 co-relation queries the response was YES. Maximal size of possible extension queue 1431. Compared 241396 event pairs, 8876 based on Foata normal form. 2716/42164 useless extension candidates. Maximal degree in co-relation 285896. Up to 23971 conditions per place. [2023-01-28 04:26:43,970 INFO L137 encePairwiseOnDemand]: 291/296 looper letters, 368 selfloop transitions, 44 changer transitions 5/431 dead transitions. [2023-01-28 04:26:43,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 431 transitions, 7942 flow [2023-01-28 04:26:43,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 04:26:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 04:26:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 869 transitions. [2023-01-28 04:26:43,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4194015444015444 [2023-01-28 04:26:43,972 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 869 transitions. [2023-01-28 04:26:43,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 869 transitions. [2023-01-28 04:26:43,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:26:43,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 869 transitions. [2023-01-28 04:26:43,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 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-28 04:26:43,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 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-28 04:26:43,974 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 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-28 04:26:43,974 INFO L175 Difference]: Start difference. First operand has 177 places, 347 transitions, 5619 flow. Second operand 7 states and 869 transitions. [2023-01-28 04:26:43,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 431 transitions, 7942 flow [2023-01-28 04:26:45,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 431 transitions, 7749 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-01-28 04:26:45,775 INFO L231 Difference]: Finished difference. Result has 179 places, 348 transitions, 5598 flow [2023-01-28 04:26:45,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=5467, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5598, PETRI_PLACES=179, PETRI_TRANSITIONS=348} [2023-01-28 04:26:45,775 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 139 predicate places. [2023-01-28 04:26:45,775 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 348 transitions, 5598 flow [2023-01-28 04:26:45,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 118.86666666666666) internal successors, (1783), 15 states have internal predecessors, (1783), 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-28 04:26:45,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:26:45,776 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2023-01-28 04:26:45,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-01-28 04:26:45,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-01-28 04:26:45,981 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:26:45,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:26:45,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1759637409, now seen corresponding path program 14 times [2023-01-28 04:26:45,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:26:45,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7202723] [2023-01-28 04:26:45,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:26:45,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:26:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:26:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 04:26:46,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:26:46,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7202723] [2023-01-28 04:26:46,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7202723] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:26:46,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444821589] [2023-01-28 04:26:46,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 04:26:46,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:26:46,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:26:46,689 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 04:26:46,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-28 04:26:46,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 04:26:46,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:26:46,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 41 conjunts are in the unsatisfiable core [2023-01-28 04:26:46,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:26:47,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 04:26:47,050 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-28 04:26:47,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 04:26:47,090 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-28 04:26:47,234 INFO L321 Elim1Store]: treesize reduction 14, result has 61.1 percent of original size [2023-01-28 04:26:47,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 43 treesize of output 40 [2023-01-28 04:26:47,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 04:26:47,281 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-28 04:26:47,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 04:26:47,319 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 23 treesize of output 22 [2023-01-28 04:26:47,346 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 17 treesize of output 9 [2023-01-28 04:26:47,397 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 04:26:47,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:26:47,552 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~b1~0 256) 0) (forall ((v_ArrVal_1012 Int) (v_ArrVal_1010 (Array Int Int))) (let ((.cse0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1010) c_~A~0.base) (+ (* 4 |c_thread3Thread1of1ForFork0_~i~2#1|) c_~A~0.offset) v_ArrVal_1012) c_~A~0.offset))) (or (< c_~min~0 (+ 2 .cse0)) (< 2147483646 .cse0))))) is different from false [2023-01-28 04:26:47,575 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~b1~0 256) 0) (forall ((v_ArrVal_1012 Int) (|v_thread3Thread1of1ForFork0_~i~2#1_67| Int) (v_ArrVal_1010 (Array Int Int)) (v_ArrVal_1008 Int)) (let ((.cse1 (select |c_#memory_int| c_~A~0.base)) (.cse2 (+ (* 4 |c_thread3Thread1of1ForFork0_~i~2#1|) c_~A~0.offset))) (let ((.cse0 (select (store (select (store (store |c_#memory_int| c_~A~0.base (store .cse1 .cse2 v_ArrVal_1008)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1010) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_67| 4)) v_ArrVal_1012) c_~A~0.offset))) (or (< 2147483646 .cse0) (< |v_thread3Thread1of1ForFork0_~i~2#1_67| (+ 1 |c_thread3Thread1of1ForFork0_~i~2#1|)) (< (+ v_ArrVal_1008 1) (select .cse1 .cse2)) (< c_~min~0 (+ 2 .cse0))))))) is different from false [2023-01-28 04:26:47,597 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~b1~0 256) 0) (forall ((v_ArrVal_1012 Int) (|v_thread3Thread1of1ForFork0_~i~2#1_67| Int) (v_ArrVal_1010 (Array Int Int)) (v_ArrVal_1008 Int)) (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select (store (select (store (store |c_#memory_int| c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_1008)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1010) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_67| 4)) v_ArrVal_1012) c_~A~0.offset))) (or (< 2147483646 .cse0) (< (+ v_ArrVal_1008 1) (select .cse1 c_~A~0.offset)) (< c_~min~0 (+ .cse0 2)) (< |v_thread3Thread1of1ForFork0_~i~2#1_67| 1)))))) is different from false [2023-01-28 04:26:47,701 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse3 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select .cse3 c_~A~0.offset))) (and (forall ((v_ArrVal_1008 Int)) (or (< (+ v_ArrVal_1008 1) .cse0) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_67| Int)) (or (< |v_thread3Thread1of1ForFork0_~i~2#1_67| 1) (forall ((v_ArrVal_1012 Int) (v_ArrVal_1010 (Array Int Int))) (let ((.cse1 (select (store (select (store (store |c_#memory_int| c_~A~0.base (store .cse3 c_~A~0.offset v_ArrVal_1008)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1010) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_67| 4)) v_ArrVal_1012) c_~A~0.offset))) (or (< 2147483646 .cse1) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (let ((.cse2 (select .cse3 (+ c_~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (< c_~min~0 .cse2) (< .cse2 (+ .cse1 2)))))))))))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (<= (select .cse3 (+ c_~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) c_~min~0)) (forall ((v_ArrVal_1012 Int) (|v_thread3Thread1of1ForFork0_~i~2#1_67| Int) (v_ArrVal_1010 (Array Int Int)) (v_ArrVal_1008 Int)) (let ((.cse4 (select (store (select (store (store |c_#memory_int| c_~A~0.base (store .cse3 c_~A~0.offset v_ArrVal_1008)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1010) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_67| 4)) v_ArrVal_1012) c_~A~0.offset))) (or (< 2147483646 .cse4) (< (+ v_ArrVal_1008 1) .cse0) (< c_~min~0 (+ .cse4 2)) (< |v_thread3Thread1of1ForFork0_~i~2#1_67| 1)))))))) (= (mod c_~b1~0 256) 0)) is different from false [2023-01-28 04:26:51,582 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4))))) (and (or (< c_~min~0 .cse0) (and (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1008 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1006) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1007))) (let ((.cse3 (select .cse4 c_~A~0.base))) (or (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_67| Int)) (or (< |v_thread3Thread1of1ForFork0_~i~2#1_67| 1) (forall ((v_ArrVal_1012 Int) (v_ArrVal_1010 (Array Int Int))) (let ((.cse1 (select (store (select (store (store .cse4 c_~A~0.base (store .cse3 c_~A~0.offset v_ArrVal_1008)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1010) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_67| 4)) v_ArrVal_1012) c_~A~0.offset))) (or (< 2147483646 .cse1) (forall ((v_subst_1 Int)) (let ((.cse2 (select .cse3 (+ c_~A~0.offset (* 4 v_subst_1))))) (or (< .cse0 .cse2) (< .cse2 (+ .cse1 2)))))))))) (< (+ v_ArrVal_1008 1) (select .cse3 c_~A~0.offset)))))) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1006) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1007))) (let ((.cse5 (select .cse7 c_~A~0.base))) (or (forall ((v_subst_2 Int)) (<= (select .cse5 (+ c_~A~0.offset (* 4 v_subst_2))) .cse0)) (forall ((v_ArrVal_1012 Int) (|v_thread3Thread1of1ForFork0_~i~2#1_67| Int) (v_ArrVal_1010 (Array Int Int)) (v_ArrVal_1008 Int)) (let ((.cse6 (select (store (select (store (store .cse7 c_~A~0.base (store .cse5 c_~A~0.offset v_ArrVal_1008)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1010) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_67| 4)) v_ArrVal_1012) c_~A~0.offset))) (or (< 2147483646 .cse6) (< |v_thread3Thread1of1ForFork0_~i~2#1_67| 1) (< (+ v_ArrVal_1008 1) (select .cse5 c_~A~0.offset)) (< .cse0 (+ .cse6 2))))))))))) (or (<= .cse0 c_~min~0) (and (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1008 Int)) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1006) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1007))) (let ((.cse10 (select .cse11 c_~A~0.base))) (or (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_67| Int)) (or (forall ((v_ArrVal_1012 Int) (v_ArrVal_1010 (Array Int Int))) (let ((.cse8 (select (store (select (store (store .cse11 c_~A~0.base (store .cse10 c_~A~0.offset v_ArrVal_1008)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1010) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_67| 4)) v_ArrVal_1012) c_~A~0.offset))) (or (< 2147483646 .cse8) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (let ((.cse9 (select .cse10 (+ c_~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (< .cse9 (+ .cse8 2)) (< c_~min~0 .cse9))))))) (< |v_thread3Thread1of1ForFork0_~i~2#1_67| 1))) (< (+ v_ArrVal_1008 1) (select .cse10 c_~A~0.offset)))))) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1006) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1007))) (let ((.cse13 (select .cse14 c_~A~0.base))) (or (forall ((v_ArrVal_1012 Int) (|v_thread3Thread1of1ForFork0_~i~2#1_67| Int) (v_ArrVal_1010 (Array Int Int)) (v_ArrVal_1008 Int)) (let ((.cse12 (select (store (select (store (store .cse14 c_~A~0.base (store .cse13 c_~A~0.offset v_ArrVal_1008)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1010) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_67| 4)) v_ArrVal_1012) c_~A~0.offset))) (or (< 2147483646 .cse12) (< |v_thread3Thread1of1ForFork0_~i~2#1_67| 1) (< (+ v_ArrVal_1008 1) (select .cse13 c_~A~0.offset)) (< c_~min~0 (+ .cse12 2))))) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (<= (select .cse13 (+ c_~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) c_~min~0)))))))))) (= (mod c_~b1~0 256) 0)) is different from false [2023-01-28 04:26:52,521 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 1141 treesize of output 1077 [2023-01-28 04:26:52,536 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 04:26:52,545 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 04:26:52,545 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 209 treesize of output 201 [2023-01-28 04:26:52,555 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 04:26:52,565 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 04:26:52,566 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 341 treesize of output 317 [2023-01-28 04:26:52,572 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 04:26:52,579 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 04:26:52,582 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 193 treesize of output 193 [2023-01-28 04:26:52,598 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 331 treesize of output 315 [2023-01-28 04:26:52,977 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 04:26:52,978 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 04:26:52,978 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 04:26:52,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 57 [2023-01-28 04:26:52,992 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-28 04:26:52,992 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 65 treesize of output 1 [2023-01-28 04:26:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 5 not checked. [2023-01-28 04:26:53,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444821589] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:26:53,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:26:53,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 41 [2023-01-28 04:26:53,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376088774] [2023-01-28 04:26:53,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:26:53,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-01-28 04:26:53,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:26:53,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-01-28 04:26:53,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1193, Unknown=18, NotChecked=380, Total=1806 [2023-01-28 04:26:53,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 296 [2023-01-28 04:26:53,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 348 transitions, 5598 flow. Second operand has 43 states, 43 states have (on average 97.30232558139535) internal successors, (4184), 43 states have internal predecessors, (4184), 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-28 04:26:53,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:26:53,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 296 [2023-01-28 04:26:53,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:27:04,483 WARN L222 SmtUtils]: Spent 5.94s on a formula simplification. DAG size of input: 120 DAG size of output: 88 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 04:27:15,748 WARN L222 SmtUtils]: Spent 11.11s on a formula simplification. DAG size of input: 112 DAG size of output: 85 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 04:27:18,792 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-28 04:27:27,398 WARN L222 SmtUtils]: Spent 8.52s on a formula simplification. DAG size of input: 120 DAG size of output: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 04:27:32,371 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-28 04:27:39,101 WARN L222 SmtUtils]: Spent 6.25s on a formula simplification. DAG size of input: 113 DAG size of output: 79 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 04:27:41,117 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-28 04:27:46,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 04:27:48,492 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-28 04:27:50,497 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-28 04:27:52,504 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-28 04:27:54,511 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-28 04:28:02,073 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] Received shutdown request... [2023-01-28 04:28:02,281 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 04:28:02,281 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-28 04:28:03,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-28 04:28:03,482 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-01-28 04:28:03,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-01-28 04:28:03,516 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 04:28:03,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-01-28 04:28:03,517 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-01-28 04:28:03,518 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-01-28 04:28:03,518 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-28 04:28:03,518 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-28 04:28:03,518 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-01-28 04:28:03,518 INFO L445 BasicCegarLoop]: Path program histogram: [14, 1, 1, 1, 1] [2023-01-28 04:28:03,520 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 04:28:03,520 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 04:28:03,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 04:28:03 BasicIcfg [2023-01-28 04:28:03,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 04:28:03,522 INFO L158 Benchmark]: Toolchain (without parser) took 815176.09ms. Allocated memory was 364.9MB in the beginning and 15.2GB in the end (delta: 14.8GB). Free memory was 303.6MB in the beginning and 13.3GB in the end (delta: -13.0GB). Peak memory consumption was 1.7GB. Max. memory is 16.0GB. [2023-01-28 04:28:03,522 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 364.9MB. Free memory is still 313.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 04:28:03,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.26ms. Allocated memory is still 364.9MB. Free memory was 303.6MB in the beginning and 291.6MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-01-28 04:28:03,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.86ms. Allocated memory is still 364.9MB. Free memory was 291.6MB in the beginning and 289.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 04:28:03,522 INFO L158 Benchmark]: Boogie Preprocessor took 20.63ms. Allocated memory is still 364.9MB. Free memory was 289.6MB in the beginning and 287.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 04:28:03,523 INFO L158 Benchmark]: RCFGBuilder took 616.16ms. Allocated memory was 364.9MB in the beginning and 507.5MB in the end (delta: 142.6MB). Free memory was 287.9MB in the beginning and 458.6MB in the end (delta: -170.7MB). Peak memory consumption was 15.6MB. Max. memory is 16.0GB. [2023-01-28 04:28:03,523 INFO L158 Benchmark]: TraceAbstraction took 814289.15ms. Allocated memory was 507.5MB in the beginning and 15.2GB in the end (delta: 14.6GB). Free memory was 457.8MB in the beginning and 13.3GB in the end (delta: -12.9GB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. [2023-01-28 04:28:03,523 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.08ms. Allocated memory is still 364.9MB. Free memory is still 313.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 211.26ms. Allocated memory is still 364.9MB. Free memory was 303.6MB in the beginning and 291.6MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 34.86ms. Allocated memory is still 364.9MB. Free memory was 291.6MB in the beginning and 289.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 20.63ms. Allocated memory is still 364.9MB. Free memory was 289.6MB in the beginning and 287.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 616.16ms. Allocated memory was 364.9MB in the beginning and 507.5MB in the end (delta: 142.6MB). Free memory was 287.9MB in the beginning and 458.6MB in the end (delta: -170.7MB). Peak memory consumption was 15.6MB. Max. memory is 16.0GB. * TraceAbstraction took 814289.15ms. Allocated memory was 507.5MB in the beginning and 15.2GB in the end (delta: 14.6GB). Free memory was 457.8MB in the beginning and 13.3GB in the end (delta: -12.9GB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 147 PlacesBefore, 40 PlacesAfterwards, 146 TransitionsBefore, 31 TransitionsAfterwards, 2280 CoEnabledTransitionPairs, 7 FixpointIterations, 67 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 17 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 134 TotalNumberOfCompositions, 3482 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2552, independent: 2466, independent conditional: 0, independent unconditional: 2466, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1219, independent: 1190, independent conditional: 0, independent unconditional: 1190, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2552, independent: 1276, independent conditional: 0, independent unconditional: 1276, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 1219, unknown conditional: 0, unknown unconditional: 1219] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 190 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 814.2s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 14, EmptinessCheckTime: 0.0s, AutomataDifference: 774.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 5347 SdHoareTripleChecker+Valid, 31.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5347 mSDsluCounter, 347 SdHoareTripleChecker+Invalid, 30.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3932 IncrementalHoareTripleChecker+Unchecked, 305 mSDsCounter, 532 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14807 IncrementalHoareTripleChecker+Invalid, 19281 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 532 mSolverCounterUnsat, 42 mSDtfsCounter, 14807 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1297 GetRequests, 566 SyntacticMatches, 33 SemanticMatches, 698 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 20204 ImplicationChecksByTransitivity, 195.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10845occurred in iteration=11, InterpolantAutomatonStates: 421, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 30.7s InterpolantComputationTime, 940 NumberOfCodeBlocks, 940 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1280 ConstructedInterpolants, 60 QuantifiedInterpolants, 13698 SizeOfPredicates, 175 NumberOfNonLiveVariables, 3567 ConjunctsInSsa, 338 ConjunctsInUnsatCore, 42 InterpolantComputations, 9 PerfectInterpolantSequences, 131/218 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown